Similarity of closed polygonal curves in Frechet metric
نویسندگان
چکیده
Received (received date) Revised (revised date) Communicated by (Name) The article analyzes similarity of closed polygonal curves in Frechet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm that determines whether the Frechet distance between two closed polygonal curves with m and n vertices is less than a given number ε is described. The described algorithm takes O(mn) time whereas the previously known algorithms take O(mn log(mn)) time.
منابع مشابه
Frechet similarity of closed polygonal curves
Received (received date) Revised (revised date) Communicated by (Name) The article analyzes similarity of closed polygonal curves with respect to the Fréchet metric, which is stronger than the well-known Hausdorff metric and therefore is more appropriate in some applications. An algorithm is described that determines whether the Fréchet distance between two closed polygonal curves with m and n ...
متن کاملApplied Similarity Problems Using Frechet Distance
The Fréchet distance is a well-known metric to measure similarity of polygonal curves. In the first part of this thesis, we introduce a new metric called Fréchet distance with speed limits and provide efficient algorithms for computing it. The classical Fréchet distance between two curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-n...
متن کاملPolygonal Approximation of Closed Curves across Multiple Views
Polygon approximation is an important step in the recognition of planar shapes. Traditional polygonal approximation algorithms handle only images that are related by a similarity transformation. The transformation of a planar shape as the viewpoint changes with a perspective camera is a general projective one. In this paper, we present a novel method for polygonal approximation of closed curves...
متن کاملLower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance
We give lower bounds for the combinatorial complexity of the Voronoi diagram of polygonal curves under the discrete Fréchet distance. We show that the Voronoi diagram of n curves in R with k vertices each, has complexity Ω(n) for dimension d = 1, 2 and Ω(nd(k−1)+2) for d > 2.
متن کاملComputing Discrete Fréchet Distance
The Fréchet distance between two curves in a metric space is a measure of the similarity between the curves. We present a discrete variation of this measure. It provides good approximations of the continuous measure and can be efficiently computed using a simple algorithm. We also consider variants of discrete Fréchet distance, and find an interesting connection to measuring distance between th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1409.4613 شماره
صفحات -
تاریخ انتشار 2014